stringFuncs.isVariable - Code Metrics - Inspection of "reorganize & renaming files" - nightfury7/universalbasics.js - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Push — master ( ad9a28...55041a )

by Night

created 2018-07-15 12:26 UTC

stringFuncs.isVariable C

↳ Parent: src/ub.strings.asserts.js

Complexity

Conditions	9
Paths	4

Size

Total Lines	19
Code Lines	10

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
cc	9
eloc	10
nc	4
nop	1
dl	0
loc	19
rs	6.6666
c	0
b	0
f	0

/** global: UB */

var stringFuncs = {
	
	
	// checks
	isAllCaps: function(){
		var str = this;
		return (str.toUpperCase() == str);
	},
	isUppercase: function(){
		var str = this;
		return (str.toUpperCase() == str);
	},
	isLowercase: function(){
		var str = this;
		return (str.toLowerCase() == str);
	},
	isAcronym: function(){
		var str = this;
		if (str.length >= 2) {
			var c1 = str.charAt(0);
			var c2 = str.charAt(1);
			return (c1 == c1.toUpperCase() && c2 == c2.toUpperCase());
		}
		return false;
	},
	isComplexNumber: function(){
		var text = this;
		return text.contains("0x") || text.contains("0X") || text.contains("+e") || text.contains("+E") || text.contains("-e") || text.contains("-E");
	},
	
	isBlank: function(trimAndCheck = true){
		var str = this;
		if (str == null || str == "") {

			return true;
		}
		if (trimAndCheck) {
			return str.trim() == "";
		}
		return false;
	},
	isWhitespace: function(newlines){
		var char = this;
		if (newlines) {
			return char == ' ' || char == '\r' || char == '\n' || char == '\t';
		} else {

			return char == ' ' || char == '\t';
		}
	},
	isNumber: function(){
		var char = this;
		var code = char.charCodeAt(0);
		return (code >= UB.charCodes._0 && code <= UB.charCodes._9);
	},
	isAlphaNumeric: function(){
		var char = this;
		var code = char.charCodeAt(0);
		if (code >= 48 && code <= 57){
			return true;
		}
		if (code >= 65 && code <= 90){
			return true;
		}
		if (code >= 97 && code <= 122){
			return true;
		}
		return false;
	},
	isAlphabet: function(){
		var char = this;
		var code = char.charCodeAt(0);
		if (code >= 65 && code <= 90){
			return true;
		}
		if (code >= 97 && code <= 122){
			return true;
		}
		return false;
	},
	isLetter: function(){
		var char = this;
		var code = char.charCodeAt(0);
		if (code >= 65 && code <= 90){
			return true;
		}
		if (code >= 97 && code <= 122){
			return true;
		}
		return false;
	},
	isQuote: function(){
		var char = this;
		return (char == '"' || char == "'");
	},
	isMultiline: function(trimAndCheck = true){
		var str = this;
		
		// if the trimmed string has newline chars then is multiline
		if (trimAndCheck) {
			str = str.replace(UB.regex.Trim, "");
		}
		return (str.indexOf("\n") > -1 || str.indexOf("\r") > -1);
	},
	isNewline: function(){
		var str = this;
		
		// if the trimmed string has newline chars then is multiline
		return str == "\n" || str == "\r";
	},
	isSingleline: function(){
		var str = this;
		
		// if the trimmed string has no newline chars then is singleline
		return !str.isMultiline();
	},
	isDigit: function(){
		var ch = this;
		return ( ch >= '0' && ch <= '9' );
	},
	isHexDigit: function(){
		var ch = this;
		return ( (ch >= '0' && ch <= '9') || ( ch >= 'A' && ch <= 'F' ) || ( ch >= 'a' && ch <= 'f' ) );
	},
	isAny: function(haystacks, doTrim = true, caseSensitive = true){
		var needle = this;
		
		// return true if any haystack equals the needle
		for (var s = 0, sl = haystacks.length;s<sl;s++){
			var str = haystacks[s];
			if (doTrim) {
				str = str.trim();
			}
			if (caseSensitive) {
				if (needle == str) {
					return true;
				}
			}else {
				if (needle.isEqual(str, false)) {
					return true;
				}
			}
		}
		return false;
	},
	isPrefixNums: function(prefix){
		var prefixAndNums = this;
		// INPUT:	"Mesh100", "Mesh"
		// OUTPUT:	true
		// INPUT:	"Mesh", "Mesh"
		// OUTPUT:	false
		// INPUT:	"Bash100", "Mesh"
		// OUTPUT:	false
		
		// prefix not found
		if (prefixAndNums.indexOf(prefix) === -1) {
			return false;
		}
		
		// split by prefix
		var parts = prefixAndNums.splitAfter(prefix);
		
		// check if prefix matches
		// check if 2nd part is NUMERIC
		return (parts[0] == prefix && parts[1].isNumeric());
	},
	isEmpty: function(){
		var text = this;
		return text.trim().length === 0;
	},
	isNumeric: function(withDot = true, withDash = true){
		var str = this;
		
		// per char
		for (var c = 0, cl = str.length;c<cl;c++){
			var code = str.charCodeAt(c);
			
			// if char not number ... or dot and dot not ok ... or dash and dash not ok
			if (!((code >= UB.charCodes._0 && code <= UB.charCodes._9) || (withDot && code == UB.charCodes.Dot) || (withDash && code == UB.charCodes.Minus && c === 0))) {
				return false;
			}
		}
		
		// if all chars OK then is numeric
		return true;
	},		
	isInt: function(){
		var text = this;
		return String(parseInt(text)) == text;
	},
	isNumericUnknown: function(){
		var text = this;
		//  ?????????
		return UB.regex.IsNumeric.test(text);
	},
	isWindowsPath: function(){
		var str = this;
		
		/// c:\temp
		/// D:\My\Data\File.txt
		
		if (str.charAt(1) == ":"){
			if (str.indexOf("\\") == 2) {
				if(str.charAt(0).isAlphaNumeric()){
					return true;
				}
			}
		}
		return false;
	},
	isWindowsPathAll: function(){
		var str = this;
		
		/*
		 * WORKS FOR:
		 * 
		c:\temp
		D:\directoryname\testing\
		\john-desktop\tempdir\
		*/
		
		var c0 = str.charAt(0);
		var c1 = str.charAt(1);
		var c2 = str.charAt(2);
		if(c0 != "\\" || c1 != "\\"){
			if(c0.match(new RegExp("^[a-zA-Z]"))){
				if (c1.match(new RegExp("^[:]"))){
					if (c2.match(new RegExp("^[\\/\\\\]"))) {
						return true;
					}
				}
			}
		}
		return false;
	},
	isURL: function(){
		var str = this;
		if (str.indexOf("/") > -1) {
			return UB.regex.IsURL.test(str);
		}
		return false;
	},
	isEmail: function(){
		var str = this;
		
		// perform quick tests before regex
		var lastAtPos = str.lastIndexOf('@');
		if (lastAtPos === -1) {
			return false;
		}
		var lastDotPos = str.lastIndexOf('.');
		if (lastDotPos === -1) {
			return false;
		}
		
		// Last "@" before last "." since "@" cannot be part of server name
		// something (the email username) before the last @
		// no "@@" in the address. Even if "@" appears as the last character in email username, it has to be quoted so " would be between that "@" and the last "@" in the address
		// at least 3 characters before the last dot, for example "[email protected]"
		// enough characters after the last dot to form a two-character domain
		if ((lastAtPos < lastDotPos && lastAtPos > 0 && str.indexOf('@@') === -1 && lastDotPos > 2 && (str.length - lastDotPos) > 2) == false) {

			return false;
		}
		
		// perform slow regex test
		/// http://stackoverflow.com/a/46181
		return UB.regex.IsEmail.test(str);
	},
	isIPAddress: function(){
		var str = this;
		if (str.indexOf(".") > -1) {
			return UB.regex.IsIP.test(str);
		}
		return false;
	},
	isSymbol: function(){
		var char = this;
		return UB.commonSymbols.indexOf(char) > -1;
	},
	isVariable: function(spaceOk = false){
		var str = this;
		
		// if first char is LETTER..
		if (str.length > 0 && str.charAt(0).isOfCharRange("letter")) {
			
			// ..and other chars are LETTER, DIGIT or "_"
			for (var c = 1, cl = str.length;c<cl;c++){
				var char = str.charAt(c);
				if (char.isDigit() || char.isLetter() || char == "_" || (spaceOk && char == " ")) {

				}else {
					return false;
				}
			}
			return true;
		}
		
		return false;
	},
	
	// counting
	countStartingChars: function(char){
		var str = this;
		for (var c = 0, cl = str.length;c<cl;c++){
			if (str.charAt(c) != char) {
				return c;
			}
		}
		return cl;
	},
	countEndingChars: function(char){
		var str = this;
		var cl = str.length;
		for (var c = cl;c >= 0;c--){
			if (str.charAt(c) != char) {
				return cl - c;
			}
		}
		return cl;
	},
	countStartingUppercase: function(){
		var str = this;
		for (var c = 0, cl = str.length;c<cl;c++){
			if (!str.charAt(c).isUppercase()) {
				return c;
			}
		}
		return 0;
	},
	countStartingLowercase: function(){
		var str = this;
		for (var c = 0, cl = str.length;c<cl;c++){
			if (!str.charAt(c).isLowercase()) {
				return c;
			}
		}
		return 0;
	},
	
	
	none:null
};

// register funcs
UB.registerFuncs(String.prototype, stringFuncs);


1			/** global: UB */
2
3			var stringFuncs = {
4
5
6			// checks
7			isAllCaps: function(){
8			var str = this;
9			return (str.toUpperCase() == str);
10			},
11			isUppercase: function(){
12			var str = this;
13			return (str.toUpperCase() == str);
14			},
15			isLowercase: function(){
16			var str = this;
17			return (str.toLowerCase() == str);
18			},
19			isAcronym: function(){
20			var str = this;
21			if (str.length >= 2) {
22			var c1 = str.charAt(0);
23			var c2 = str.charAt(1);
24			return (c1 == c1.toUpperCase() && c2 == c2.toUpperCase());
25			}
26			return false;
27			},
28			isComplexNumber: function(){
29			var text = this;
30			return text.contains("0x") \|\| text.contains("0X") \|\| text.contains("+e") \|\| text.contains("+E") \|\| text.contains("-e") \|\| text.contains("-E");
31			},
32
33			isBlank: function(trimAndCheck = true){
34			var str = this;
35			if (str == null \|\| str == "") {
			1 ignored issue – show Best Practice introduced 2018-07-12 06:57 UTC by Report Bug Copy Issue Report Comparing `str` to `null` using the `==` operator is not safe. Consider using `===` instead. Loading history...
36			return true;
37			}
38			if (trimAndCheck) {
39			return str.trim() == "";
40			}
41			return false;
42			},
43			isWhitespace: function(newlines){
44			var char = this;
45			if (newlines) {
46			return char == ' ' \|\| char == '\r' \|\| char == '\n' \|\| char == '\t';
47			} else {
			0 ignored issues – show Comprehensibility introduced 2018-07-12 06:57 UTC by Report Bug Copy Issue Report `else` is not necessary here since all `if` branches return, consider removing it to reduce nesting and make code more readable. Loading history...
48			return char == ' ' \|\| char == '\t';
49			}
50			},
51			isNumber: function(){
52			var char = this;
53			var code = char.charCodeAt(0);
54			return (code >= UB.charCodes._0 && code <= UB.charCodes._9);
55			},
56			isAlphaNumeric: function(){
57			var char = this;
58			var code = char.charCodeAt(0);
59			if (code >= 48 && code <= 57){
60			return true;
61			}
62			if (code >= 65 && code <= 90){
63			return true;
64			}
65			if (code >= 97 && code <= 122){
66			return true;
67			}
68			return false;
69			},
70			isAlphabet: function(){
71			var char = this;
72			var code = char.charCodeAt(0);
73			if (code >= 65 && code <= 90){
74			return true;
75			}
76			if (code >= 97 && code <= 122){
77			return true;
78			}
79			return false;
80			},
81			isLetter: function(){
82			var char = this;
83			var code = char.charCodeAt(0);
84			if (code >= 65 && code <= 90){
85			return true;
86			}
87			if (code >= 97 && code <= 122){
88			return true;
89			}
90			return false;
91			},
92			isQuote: function(){
93			var char = this;
94			return (char == '"' \|\| char == "'");
95			},
96			isMultiline: function(trimAndCheck = true){
97			var str = this;
98
99			// if the trimmed string has newline chars then is multiline
100			if (trimAndCheck) {
101			str = str.replace(UB.regex.Trim, "");
102			}
103			return (str.indexOf("\n") > -1 \|\| str.indexOf("\r") > -1);
104			},
105			isNewline: function(){
106			var str = this;
107
108			// if the trimmed string has newline chars then is multiline
109			return str == "\n" \|\| str == "\r";
110			},
111			isSingleline: function(){
112			var str = this;
113
114			// if the trimmed string has no newline chars then is singleline
115			return !str.isMultiline();
116			},
117			isDigit: function(){
118			var ch = this;
119			return ( ch >= '0' && ch <= '9' );
120			},
121			isHexDigit: function(){
122			var ch = this;
123			return ( (ch >= '0' && ch <= '9') \|\| ( ch >= 'A' && ch <= 'F' ) \|\| ( ch >= 'a' && ch <= 'f' ) );
124			},
125			isAny: function(haystacks, doTrim = true, caseSensitive = true){
126			var needle = this;
127
128			// return true if any haystack equals the needle
129			for (var s = 0, sl = haystacks.length;s<sl;s++){
130			var str = haystacks[s];
131			if (doTrim) {
132			str = str.trim();
133			}
134			if (caseSensitive) {
135			if (needle == str) {
136			return true;
137			}
138			}else {
139			if (needle.isEqual(str, false)) {
140			return true;
141			}
142			}
143			}
144			return false;
145			},
146			isPrefixNums: function(prefix){
147			var prefixAndNums = this;
148			// INPUT: "Mesh100", "Mesh"
149			// OUTPUT: true
150			// INPUT: "Mesh", "Mesh"
151			// OUTPUT: false
152			// INPUT: "Bash100", "Mesh"
153			// OUTPUT: false
154
155			// prefix not found
156			if (prefixAndNums.indexOf(prefix) === -1) {
157			return false;
158			}
159
160			// split by prefix
161			var parts = prefixAndNums.splitAfter(prefix);
162
163			// check if prefix matches
164			// check if 2nd part is NUMERIC
165			return (parts[0] == prefix && parts[1].isNumeric());
166			},
167			isEmpty: function(){
168			var text = this;
169			return text.trim().length === 0;
170			},
171			isNumeric: function(withDot = true, withDash = true){
172			var str = this;
173
174			// per char
175			for (var c = 0, cl = str.length;c<cl;c++){
176			var code = str.charCodeAt(c);
177
178			// if char not number ... or dot and dot not ok ... or dash and dash not ok
179			if (!((code >= UB.charCodes._0 && code <= UB.charCodes._9) \|\| (withDot && code == UB.charCodes.Dot) \|\| (withDash && code == UB.charCodes.Minus && c === 0))) {
180			return false;
181			}
182			}
183
184			// if all chars OK then is numeric
185			return true;
186			},
187			isInt: function(){
188			var text = this;
189			return String(parseInt(text)) == text;
190			},
191			isNumericUnknown: function(){
192			var text = this;
193			// ?????????
194			return UB.regex.IsNumeric.test(text);
195			},
196			isWindowsPath: function(){
197			var str = this;
198
199			/// c:\temp
200			/// D:\My\Data\File.txt
201
202			if (str.charAt(1) == ":"){
203			if (str.indexOf("\\") == 2) {
204			if(str.charAt(0).isAlphaNumeric()){
205			return true;
206			}
207			}
208			}
209			return false;
210			},
211			isWindowsPathAll: function(){
212			var str = this;
213
214			/*
215			* WORKS FOR:
216			*
217			c:\temp
218			D:\directoryname\testing\
219			\john-desktop\tempdir\
220			*/
221
222			var c0 = str.charAt(0);
223			var c1 = str.charAt(1);
224			var c2 = str.charAt(2);
225			if(c0 != "\\" \|\| c1 != "\\"){
226			if(c0.match(new RegExp("^[a-zA-Z]"))){
227			if (c1.match(new RegExp("^[:]"))){
228			if (c2.match(new RegExp("^[\\/\\\\]"))) {
229			return true;
230			}
231			}
232			}
233			}
234			return false;
235			},
236			isURL: function(){
237			var str = this;
238			if (str.indexOf("/") > -1) {
239			return UB.regex.IsURL.test(str);
240			}
241			return false;
242			},
243			isEmail: function(){
244			var str = this;
245
246			// perform quick tests before regex
247			var lastAtPos = str.lastIndexOf('@');
248			if (lastAtPos === -1) {
249			return false;
250			}
251			var lastDotPos = str.lastIndexOf('.');
252			if (lastDotPos === -1) {
253			return false;
254			}
255
256			// Last "@" before last "." since "@" cannot be part of server name
257			// something (the email username) before the last @
258			// no "@@" in the address. Even if "@" appears as the last character in email username, it has to be quoted so " would be between that "@" and the last "@" in the address
259			// at least 3 characters before the last dot, for example "[email protected]"
260			// enough characters after the last dot to form a two-character domain
261			if ((lastAtPos < lastDotPos && lastAtPos > 0 && str.indexOf('@@') === -1 && lastDotPos > 2 && (str.length - lastDotPos) > 2) == false) {
			1 ignored issue – show Best Practice introduced 2018-07-14 05:49 UTC by Report Bug Copy Issue Report Comparing `lastAtPos < lastDotPos &...length - lastDotPos > 2` to `false` using the `==` operator is not safe. Consider using `===` instead. Loading history...
262			return false;
263			}
264
265			// perform slow regex test
266			/// http://stackoverflow.com/a/46181
267			return UB.regex.IsEmail.test(str);
268			},
269			isIPAddress: function(){
270			var str = this;
271			if (str.indexOf(".") > -1) {
272			return UB.regex.IsIP.test(str);
273			}
274			return false;
275			},
276			isSymbol: function(){
277			var char = this;
278			return UB.commonSymbols.indexOf(char) > -1;
279			},
280			isVariable: function(spaceOk = false){
281			var str = this;
282
283			// if first char is LETTER..
284			if (str.length > 0 && str.charAt(0).isOfCharRange("letter")) {
285
286			// ..and other chars are LETTER, DIGIT or "_"
287			for (var c = 1, cl = str.length;c<cl;c++){
288			var char = str.charAt(c);
289			if (char.isDigit() \|\| char.isLetter() \|\| char == "_" \|\| (spaceOk && char == " ")) {
			0 ignored issues – show Comprehensibility Documentation Best Practice introduced 2018-07-12 06:57 UTC by Report Bug Copy Issue Report This code block is empty. Consider removing it or adding a comment to explain. Loading history...
290			}else {
291			return false;
292			}
293			}
294			return true;
295			}
296
297			return false;
298			},
299
300			// counting
301			countStartingChars: function(char){
302			var str = this;
303			for (var c = 0, cl = str.length;c<cl;c++){
304			if (str.charAt(c) != char) {
305			return c;
306			}
307			}
308			return cl;
309			},
310			countEndingChars: function(char){
311			var str = this;
312			var cl = str.length;
313			for (var c = cl;c >= 0;c--){
314			if (str.charAt(c) != char) {
315			return cl - c;
316			}
317			}
318			return cl;
319			},
320			countStartingUppercase: function(){
321			var str = this;
322			for (var c = 0, cl = str.length;c<cl;c++){
323			if (!str.charAt(c).isUppercase()) {
324			return c;
325			}
326			}
327			return 0;
328			},
329			countStartingLowercase: function(){
330			var str = this;
331			for (var c = 0, cl = str.length;c<cl;c++){
332			if (!str.charAt(c).isLowercase()) {
333			return c;
334			}
335			}
336			return 0;
337			},
338
339
340			none:null
341			};
342
343			// register funcs
344			UB.registerFuncs(String.prototype, stringFuncs);
345

nightfury7 / universalbasics.js

Push — master ( ad9a28...55041a )

stringFuncs.isVariable C

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like